package cn.zhangchg.leetcode.number;

/**
 * 两数之和
 * @author 张晨刚
 */
public class TwoSum {

    public int[] twoSum(int[] nums, int target) {
        for(int i = 0; i<nums.length;i++){
            for(int j = i + 1;j < nums.length;j++){
                if(nums[i] + nums[j] == target){
                    return new int[]{i,j};
                }
            }
        }
        return null;
    }
}
